Rough Set Models on Granular Structures and Rule Induction
نویسندگان
چکیده
This paper focuses on generalization of rough set model and rule induction. First a extension of rough set approximations is established on general granular structure, so that the rough set models on some special granular structures are meaningful. The new rough approximation operators are interpreted by topological terminology well. Conversely, by means of the new rough approximation operators, many special granular structures, such as, covering, knowledge space, topology space and Pawlak approximation space, are characterized. Furthermore, using new approximation operators, two types of decision rules can be induced.
منابع مشابه
Notes on Rough Set Approximations and Associated Measures∗
We review and compare two definitions of rough set approximations. One is defined by a pair of sets in the universe and the other by a pair of sets in the quotient universe. The latter definition, although less studied, is semantically superior for interpreting rule induction and is closely related to granularity switching in granular computing. Numerical measures about the accuracy and quality...
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کاملOn Characterization of Relation Based Rough Set Algebras
Granulation of a universe of discourse is one of the important aspects whose solution has significant bearing on Granular Computing (GrC). Many models and methods of GrC concentrating on concrete models in special contexts have been proposed and studied over the years. Rough set theory is one of the most advanced areas popularizing GrC. The concept of a rough set was originally proposed by Pawl...
متن کاملRough Sets as a Framework for Data Mining
The issues of Real World are: a) Very large data sets b) Mixed types of data (continuous valued, symbolic data) c) Uncertainty (noisy data) d) Incompleteness (missing, incomplete data) e) Data change f) Use of background knowledge The main goal of the rough set analysis is induction of approximations of concepts. Rough sets constitute a sound basis for KDD. It offers mathematical tools to disco...
متن کاملAn information fusion approach by combining multigranulation rough sets and evidence theory
Multigranulation rough set (MGRS) theory provides two kinds of qualitative combination rules that are generated by optimistic and pessimistic multigranulation fusion functions. They are used to aggregate multiple granular structures from a set theoretic standpoint. However, the two combination rules seem to lack robustness because one is too relaxed and the other too restrictive to solve some p...
متن کامل